Non-Abelian Cellular Automata
نویسنده
چکیده
We show that a wide variety of non linear cellular automata can be written as a semidirect product of linear ones and that these CAs can be predicted in parallel time O log t This class includes any CA whose rule when written as an algebra is a solvable group We also show with an induction on levels of commutators that CAs based on nilpotent groups can be predicted in parallel time O log t
منابع مشابه
Limiting Shapes for a Non-Abelian Sandpile Growth Model and Related 353 Cellular Automata
We present limiting shape results for a non-abelian variant of the abelian sandpile growth model (ASGM), some of which have no analog in the ASGM. One of our limiting shapes is an octagon. In our model, mass spreads from the origin by the toppling rule in Zhang’s sandpile model. Previously, several limiting shape results have been obtained for the ASGM using abelianness and monotonicity as main...
متن کاملLimiting Shapes for a Non-abelian Sandpile Growth Model and Related Cellular Automata
We present limiting shape results for a non-abelian variant of the abelian sandpile growth model (ASGM), some of which have no parallel in the ASGM. One of our limiting shapes is an octagon. In our model, mass spreads from the origin by the toppling rule in Zhang’s sandpile model. Previously, several limiting shape results have been obtained for the ASGM using abelianness and monotonicity as ma...
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کاملReduction of behavior of additive cellular automata on groups
A class of additive cellular automata (ACA) on a finite group is defined by an index-group g and a finite field Fp for a prime modulus p [1]. This paper deals mainly with ACA on infinite commutative groups and direct products of them with some non commutative p-groups. It appears that for all abelian groups, the rules and initial states with finite supports define behaviors which being restrict...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کامل